Upgradable photonic slot routing networks to cope with increasing capacity demands
نویسندگان
چکیده
Recently, Photonic Slot Routing (PSR) has been proposed as a practical solution for achieving optically transparent communication in Wavelength Division Multiplexing (WDM) wide-area networks. PSR makes use of available and simple wavelength-non-sensitive optical devices to switch data ows at di erent wavelengths, but in the same time slot, as a single unit. It thereby trades switching node complexity for network performance. With continuing tra c growth, the need to increase the network performance will, however, inevitably arise. As optical device technology progresses, it will become feasible to implement more complex switching nodes that can perform Individual Switching of the Wavelengths within a time slot (IWS). While IWS nodes can be expected, at least in the beginning, to be more costly than PSR nodes, they o er increased switching exibility, thereby potentially improving the network performance. This paper presents a solution that supports a gradual migration from a PSR-based network to an IWS-based network, by replacing selected PSR nodes with IWS nodes. We show that with a controlled migration towards an IWS-based network it is possible to gradually increase the capacity of the network to cope with increasing tra c demands. An important property of the solution is that upgrading a PSR node to an IWS node does not require any changes to the other nodes, or the network layout. In addition, using the NSFNET backbone topology as a benchmark, the paper shows that with an 80% PSR and 20% IWS network almost 50% of the performance reduction incurred by slot routing can be recovered.
منابع مشابه
A Hybrid Algorithm for a Two-Echelon Location- Routing Problem with Simultaneous Pickup and Delivery under Fuzzy Demand
Location-Routing Problem (LRP) emerges as one of the hybrid optimization problems in distribution networks in which, total cost of the system would be reduced significantly by simultaneous optimization of locating a set of facilities among candidate locations and routing vehicles. In this paper, a mixed integer linear programming model is presented for a two-echelon location-routing problem wit...
متن کاملRadio Mesh Networks and the Round Weighting Problem. (Les Réseaux Radio Maillés et le Problème du "Round Weighting")
In this thesis, we address the joint routing and slot assignment problem between the routers and the gateways in a radio mesh access networks. We model the problem as a RoundWeighting Problem (RWP) in which the objective is to minimize the overall period of slot activations providing enough capacity to satisfy the bandwidth requirements of the routers. Solving the full problem means generating ...
متن کاملA Review of Optical Routers in Photonic Networks-on-Chip: A Literature Survey
Due to the increasing growth of processing cores in complex computational systems, all the connection converted bottleneck for all systems. With the protection of progressing and constructing complex photonic connection on chip, optical data transmission is the best choice for replacing with electrical interconnection for the reason of gathering connection with a high bandwidth and insertion lo...
متن کاملUsing Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands
Using Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands Abstract In this paper, the capacitated location routing problem with fuzzy demands (CLRP_FD) is considered. In CLRP_FD, facility location problem (FLP) and vehicle routing problem (VRP) are observed simultaneously. Indeed the vehicles and the depots have a predefined capacity to serve the customerst...
متن کاملAn Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks
LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999